Performance Modeling of A Pro-Active Multi-Tier Dynamic Scheduling Algorithm With Threshold Deriviations

The Internet has revolutionized the culture of computing and telecommunications. The emergence of newly designed real-time multimedia applications is creating a pressing need to redesign and revamp the Internet architectures, algorithms and protocols. Scheduling algorithms are an integral component in determining the performance of packet-switched networks. Extensive research have been performed to derive the ideal correlation between scheduling algorithms, resource management and admission control. In this study, two new pro-active dynamic multi-tier scheduling algorithms for output-buffered switches with a priority and threshold derivation mechanisms are proposed. The two models are designed on the basis of the predictive service model. The proposed bandwidth and buffer management schemes are performed dynamically. A pro-active admission control algorithm is also proposed. The admission control algorithm utilizes a recursive formula to compute the probability of a packet incurring an estimated delay exceeding the stipulated service requirements. The second model integrates an additional threshold feature in the dynamic and pro-active compositions. The performance of the two proposed multi-tier scheduling algorithm is compared with the OCcuPancy_Adjusting (OCP_A) scheduling algorithm via extensive discrete-event simulation models. The simulation results demonstrate that the proposed multi-tier dynamic scheduling algorithms provide significant improvements as compared to the OCP_A.